Solving functional constraints by variable substitution
نویسندگان
چکیده
منابع مشابه
Solving functional constraints by variable substitution
Functional constraints and bi-functional constraints are an important constraint class in Constraint Programming (CP) systems, in particular for Constraint Logic Programming (CLP) systems. CP systems with finite domain constraints usually employ CSP-based solvers which use local consistency, for example, arc consistency. We introduce a new approach which is based instead on variable substitutio...
متن کاملSolving connected row convex constraints by variable elimination
We propose an algorithm for the class of connected row convex constraints. In this algorithm, we introduce a novel variable elimination method to solve the constraints. This method is simple and able to make use of the sparsity of the problem instances. One of its key operations is the composition of two constraints. We have identified several nice properties of connected row convex constraints...
متن کاملHepatitis C virus F protein sequence reveals a lack of functional constraints and a variable pattern of amino acid substitution.
Hepatitis C virus (HCV) is an important human pathogen that affects 170 million people worldwide. The HCV genome is an RNA molecule that is approximately 9.6 kb in length and encodes a polyprotein that is cleaved proteolytically to generate at least 10 mature viral proteins. Recently, a new HCV protein named F has been described, which is synthesized as a result of a ribosomal frameshift. Littl...
متن کاملSolving Geometric Constraints by Auxiliary Constructions
This paper presents an approach for solving geometric constraint problems using auxiliary constructions. This approach converts a description of constrained geometry into a sequential ruler-and-compass construction, thereby converting variational geometry constraints into parametric geometry. The solution strategy is based on constructing auxiliary geometry and new constraints by systematically...
متن کاملVirtual Substitution for SMT-Solving
SMT-solving aims at deciding satisfiability for the existential fragment of a first-order theory. A SAT-solver handles the logical part of a given problem and invokes an embedded theory solver to check consistency of theory constraints. For efficiency, the theory solver should be able to work incrementally and generate infeasible subsets. Currently available decision procedures for real algebra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2011
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068410000591